Riffle Shuffles and Their Associated Dynamical Systems

نویسنده

  • STEVEN P. LALLEY
چکیده

It is shown that for every stationary sequence of random riie permutations there is a natural associated dynamical system consisting of random orbits in the space of sequences from a nite alphabet. For many interesting models of card-shuuing, the associated dynamical systems have simple descriptions in terms of random or deterministic measure-preserving maps of the unit interval. It is shown that the rate of mixing for a card-shuuing process is constrained by the ber entropy h of this map: at least (log N)=h repititions of the shuue are needed to randomize a deck of size N , when N is large.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clumpy Riffle Shuffles

Sticky or clumpy riffle shuffles appear quite naturally in applications; however, the problem of precisely describing the convergence rate of such modified riffle shuffles has remained open for a long time. In this paper, we develop an alternative family of clumpy shuffles, and analyze their convergence rate. We then provide empirical evidence that our alternative shuffles converge at a similar...

متن کامل

Riffle Shuffles and Dynamical Systems on the Unit Interval

The preferred method of randomizing a deck of N cards is the riffle shuffle–cut the deck into two stacks, then riffle the two stacks together. A number of mathematical models have been proposed for this process. The model which has received the most attention, and about which the most is known, is the GSR (for Gilbert, Shannon, and Reeds) shuffle. In this model, all permutations with exactly on...

متن کامل

Biased Riffle Shuffles, Quasisymmetric Functions, and the Rsk Algorithm

This paper highlights the connections between riffle shuffles and symmetric functions. We analyze the effect of a riffle shuffle followed by the RSK algorithm on the resulting permutation. The theory of shuffling also allows us to deduce certain quasisymmetric function identities. Finally, we present a result about the eigenvalues of the Markov chain induced by riffle shuffles.

متن کامل

A Card Shuffling Analysis of Deformations of the Plancherel Measure of the Symmetric Group

This paper finds and analyzes a formula for the total variation distance between iterations of riffle shuffles and iterations of “cut and then riffle shuffle”. This allows one to obtain information about the convergence rate of permutation statistics (such as the length of the longest increasing subsequence or position of a given card) under these processes. Similar results are given for affine...

متن کامل

The cutoff phenomenon for randomized riffle shuffles

We study the cutoff phenomenon for generalized riffle shuffles where, at each step, the deck of cards is cut into a random number of packs of multinomial sizes which are then riffled together.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007